Solving Winner Determination Problems for Auctions with Economies of Scope and Scale
نویسندگان
چکیده
Economies of scale and scope describe key characteristics of production cost functions that influence allocations and prices on procurement markets. Auction designs for markets with economies of scale are much less well understood than combinatorial auctions, they require new bidding languages, and the supplier selection typically becomes a hard computational problem. We suggest a bidding language for respective markets, and conduct computational experiments to explore the incremental computational burden to determine optimal solutions brought about by the need to express economies of scope for problems of practical size.
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملFast winner determination for agent coordination with SBB auctions
The runtime of winner determination for each round of a sequential bundle-bid auction (= SBB auction) has recently been shown to be linear in the number of submitted bids, which makes SBB auctions appealing for solving cooperative task-assignment problems. In this paper, we introduce the Shrewd (= SHrewd Resource Efficient Winner Determination) algorithm, whose runtime is linear in the number o...
متن کاملFast Winner Determination for Agent Coordination with SBB Auctions∗ (Extended Abstract)
The runtime of winner determination for each round of a sequential bundle-bid auction (= SBB auction) has recently been shown to be linear in the number of submitted bids, which makes SBB auctions appealing for solving cooperative task-assignment problems. In this paper, we introduce the Shrewd (= SHrewd Resource Efficient Winner Determination) algorithm, whose runtime is linear in the number o...
متن کاملBid Determination in Simultaneous Auctions
In this paper, bid determination problems are studied. In particular, the central problems of allocation, acquisition, completion, and arbitrage are defined. The main theoretical result states that bid determination in double-sided auctions—i.e., completion—where goods can be sold as well as bought, is polynomial-time reducible to bid determination in single-sided auctions—i.e., acquisition. Su...
متن کاملAlgorithms for Distributed Winner Determination in Combinatorial Auctions
The problem of optimal winner determination in combinatorial auctions consists of finding the set of bids that maximize the revenue for the sellers. Various solutions exist for solving this problem but they are all centralized. That is, they assume that all bids are sent to a centralized auctioneer who then determines the winning set of bids. In this paper we introduce the problem of distribute...
متن کامل